Ultraproduct of first-order lattice-valued logic LF(X) based on finite lattice implication algebra
نویسنده
چکیده
In recent years, model theory has had remarkable success in solving important problems. Its importance lies in the observation that mathematical objects can be cast as models for a language. Ultraproduct is a method of constructing a new model from a family of models, In this paper, we deal with a new form of ultraproduct model for first-order lattice-valued logic LF(X) whose truth-value field is a finite lattice implication algebra. At the same time, Expansion theorem, two forms of fundamental theorem of ultraproducts and consistent theorem are obtained. Finally, another application of ultraproduct to algebra is discussed.
منابع مشابه
Determination of α -Resolution for Lattice-Valued First-Order Logic Based on Lattice Implication Algebra
As a continuation of our research work on resolutionbased automated reasoning approaches for latticevalued logic systems with truth-values in a latticevalued logical algebraic structure – lattice implication algebra (LIA), in the present paper, we prove thatα resolution for lattice-valued first-order logic ( ) LF X based on LIA can be equivalently transformed into that for lattice-valued propos...
متن کاملα-Quasi-Lock Semantic Resolution Method Based on Lattice-Valued Logic
Based on the general form of -resolution principle for a lattice-valued logic with truth-values defined in a latticevalued logical algebra structure lattice implication algebra, the further extended -resolution method in this lattice-valued logic is discussed in the present paper in order to increase the efficiency of the resolution method. Firstly, -quasi-lock semantic resolution method in lat...
متن کاملα-Resolution Method for Lattice-valued Horn Generalized Clauses in Lattice-valued Propositional Logic Systems
In this paper, an α-resolution method for a set of lattice-valued Horn generalized clauses is established in lattice-valued propositional logic systemL P(X) based on lattice implication algebra. Firstly, the notions of lattice-valued Horn generalized clause, normal lattice-valued Horn generalized clause and unit latticevalued Horn generalized clause are given in L P(X). Then, the α-resolution o...
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملDetermination of 3-Ary α-Resolution in Lattice-valued Propositional Logic LP(X)
One of key issues for α-n(t) ary resolution automated reasoning based on lattice-valued logic with truthvalue in a lattice implication algebra is to investigate the α-n(t) ary resolution of some generalized literals. In this article, the determination of α-resolution of any 3-ary generalized literals which include the implication operators not more than 2 in LP(X). It not only lay the foundatio...
متن کامل